Power Domination on Block-cactus Graphs∗
نویسندگان
چکیده
The problem of monitoring an electric power system is placing as few measurement devices as possible. In graph theoretical representation, it can be considered as a variant of domination problem, namely, power domination problem. This problem is to find a minimum power domination set S of a graph G = (V,E) with S ⊆ V and S can dominate all vertices and edges through the observation rules according to Kirchhoff’s current law and Ohm’s law. In this paper, we propose a lineartime algorithm for the power domination problem on block-cactus graphs.
منابع مشابه
A Characterization of the Cactus Graphs with Equal Domination and Connected Domination Numbers
A cactus graph is a connected graph in which any two cycles have at most one vertex in common. Let γ(G) and γc(G) be the domination number and connected domination number of a graph G, respectively. We can see that γ(G) ≤ γc(G) for any graph G. S. Arumugam and J. Paulraj Joseph [1] have characterized trees, unicyclic graphs and cubic graphs with equal domination and connected domination numbers...
متن کاملOn the algorithmic complexity of k-tuple total domination
For a fixed positive integer k, a k-tuple total dominating set of a graph G is a subset D ⊆ V (G) such that every vertex of G is adjacent to at least k vertices in D. The k-tuple total domination problem is to determine a minimum k-tuple total dominating set of G. This paper studies k-tuple total domination from an algorithmic point of view. In particular, we present a linear-time algorithm for...
متن کاملClaw-Free Graphs with Equal 2-Domination and Domination Numbers
For a graph G a subsetD of the vertex set of G is a k-dominating set if every vertex not in D has at least k neighbors in D. The k-domination number γk(G) is the minimum cardinality among the k-dominating sets of G. Note that the 1-domination number γ1(G) is the usual domination number γ(G). Fink and Jacobson showed in 1985 that the inequality γk(G) ≥ γ(G) + k − 2 is valid for every connected g...
متن کاملOn graphs with equal domination and 2-domination numbers
Theorem 3. (Hansberg, Volkmann [4], 2007) Let G be a cactus graph. Then γ2(G) = γ(G) if and only if G is a C4-cactus. Let H be the family of graphs such that G ∈ H if and only if either G arises from a cartesian product Kp ×Kp of two complete graphs of order p for an integer p ≥ 3 by inflating every vertex but the ones on a transversal to a clique of arbitrary order, or G is a claw-free graph w...
متن کاملPower domination in block graphs
The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well-known domination problem in graphs. In 2002, Haynes et al. considered the graph theoretical representation of this problem as a variation of the domination problem. They defined a set S to be a power dominating set of a graph if every vertex and every...
متن کامل